Extended Formulations for Sparsity Matroids
نویسندگان
چکیده
We show the existence of a polynomial-size extended formulation for the base polytope of a (k, l)-sparsity matroid. For an undirected graph G = (V,E), the size of the formulation is O(|V ||E|) when k ≥ l and O(|V ||E|) when k ≤ l. To this end, we employ the technique developed by Faenza et al. recently that uses a randomized communication protocol.
منابع مشابه
Subgraph polytopes and independence polytopes of count matroids
Given an undirected graph, the non-empty subgraph polytope is the convex hull of the characteristic vectors of pairs (F, S) where S is a nonempty subset of nodes and F is a subset of the edges with both endnodes in S. We obtain a strong relationship between the non-empty subgraph polytope and the spanning forest polytope. We further show that these polytopes provide polynomial size extended for...
متن کاملExtended Formulations for Independence Polytopes of Regular Matroids
Abstract. We show that the independence polytope of every regular matroid has an extended formulation of size quadratic in the size of its ground set. This generalizes a similar statement for (co-)graphic matroids, which is a simple consequence of Martin’s [9] extended formulation for the spanning-tree polytope. In our construction, we make use of Seymour’s decomposition theorem for regular mat...
متن کاملExtended Formulations for Polytopes of Regular Matroids
We present a simple proof of the fact that the base (and independence) polytope of a rank n regular matroid over m elements has an extension complexity O(mn).
متن کاملAn Extension of Matroid Rank Submodularity and the Z-Rayleigh Property
We define an extension of matroid rank submodularity called R-submodularity, and introduce a minor-closed class of matroids called extended submodular matroids that are well-behaved with respect to R-submodularity. We apply R-submodularity to study a class of matroids with negatively correlated multivariate Tutte polynomials called the Z-Rayleigh matroids. First, we show that the class of exten...
متن کاملGain-Sparsity and Symmetry-Forced Rigidity in the Plane
We consider planar bar-and-joint frameworks with discrete point group symmetry in which the joint positions are as generic as possible subject to the symmetry constraint. We provide combinatorial characterizations for symmetry-forced rigidity of such structures with rotation symmetry or dihedral symmetry of order 2k with odd k, unifying and extending previous work on this subject. We also explo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 158 شماره
صفحات -
تاریخ انتشار 2016